Internally club and approachable for larger structures
نویسندگان
چکیده
منابع مشابه
Internally Club and Approachable for Larger Structures
We generalize the notion of a fat subset of a regular cardinal κ to a fat subset of Pκ(X), where κ ⊆ X. Suppose μ < κ, μ<μ = μ, and κ is supercompact. Then there is a generic extension in which κ = μ++, and for all regular λ ≥ μ++, there are stationarily many N in [H(λ)]μ which are internally club but not internally approachable. Suppose μ is an infinite cardinal. A set N is internally approach...
متن کاملSymD webserver: a platform for detecting internally symmetric protein structures
Internal symmetry of a protein structure is the pseudo-symmetry that a single protein chain sometimes exhibits. This is in contrast to the symmetry with which monomers are arranged in many multimeric protein complexes. SymD is a program that detects proteins with internal symmetry. It proved to be useful for analyzing protein structure, function and modeling. This web-based interactive tool was...
متن کاملUniformly approachable maps∗
Throughout the paper we will use the standard definitions and notation ([ABR], [E]). Let X and Y be metric spaces. The goal is to study some intermediate classes of functions between the class Cuc(X,Y ) of all uniformly continuous mappings (briefly, UC) from X into Y and the class C(X,Y ) of all continuous functions f :X → Y . These classes, defined below, have been intensively studied in [BD] ...
متن کاملMaking the retina approachable.
This essay looks at the historical significance of three APS classic papers that are freely available online: Kuffler SW. Discharge patterns and functional organization of mammalian retina. J Neurophysiol 16: 37–68, 1953 (http://jn.physiology.org/cgi/reprint/16/1/37). Dowling JE and Werblin FS. Organization of retina of the mudpuppy, Necturus maculosus. I. Synaptic structure. J Neurophysiol 32:...
متن کاملSpace Efficient Data Structures for Nearest Larger Neighbor
Given a sequence of n elements from a totally ordered set, and a position in the sequence, the nearest larger neighbor (NLN) query returns the position of the element which is closest to the query position, and is larger than the element at the query position. The problem of finding all nearest larger neighbors has attracted interest due to its applications for parenthesis matching and in compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2008
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm201-2-2